Method and apparatus for flexible, accurate, and/or efficient code profiling

ABSTRACT

An apparatus and method for profiling program code. In particular, an apparatus according to one embodiment comprises a filtering component identifying a first set of instructions for which profiling is desired wherein, in response to detecting that an instruction has been retired, the filtering component determines whether the instruction is within the first set of instructions for which profiling is desired; an event selection component detecting an event in response to the instruction retiring, the event selection component generating event signals in response to a designated event; and a profiling component recording the occurrence or not occurrence of the event within a first storage device responsive to signals from the filtering component and/or the event selection component.

BACKGROUND

1. Field of the Invention

This invention relates generally to the field of computer processors.More particularly, the invention relates to an apparatus and method forflexible, accurate, and/or efficient code profiling.

2. Description of the Related Art

Program code “profiling” is a form of dynamic program analysis whichgathers information as a program executes. Profiling may be used, forexample, to determine the execution time of certain program functions aspart of a debugging process. “Sampling” is a form of program codeprofiling in which the sampling profiler probes a target program'sprogram counter at periodic intervals (e.g., using operating systeminterrupts). “Instrumentation” is yet another form of program codeprofiling in which additional instructions are added to existing programcode to collect the necessary information.

One problem which exists is that current profiling techniques affect theoperation of the underlying program code, typically reducing performanceand resulting in inaccurate results. For example, if additionalprofiling instructions are used, the extra overhead resulting from theprofiling instructions implies that either: (i) simple profiling modelsare used, or (ii) profiling is only performed during a very small timewindow. These two solutions sacrifice profiling accuracy in order toreduce the costs to obtain profile information. In addition, in thiscase, the extra instructions may have collateral effects on the eventsbeing profiled, yielding imprecise profile data. In fact, most systemstoday only profile the execution frequency of basic blocks and branchdestinations. However, numerous event types could potentially beprofiled to leverage sophisticated optimizations (e.g., L1 cache misses,branch mis-predictions, translation lookaside buffer (TLB) misses, etc).The problem with current hardware support to gather this information isthat it does not associate accurately the occurrences of events and theratios of occurrences/not occurrences of such events with individualinstructions.

Several processors already include some sampling mechanisms in order tocollect profiling information. In these cases, the user can specify asoftware service routine to be invoked when certain executioncharacteristics are met. In a typical usage scenario, the user programsa routine to be invoked periodically every, for example, 100,000 retiredinstructions. The routine then accesses a hardware structure in whichthe addresses of the last N taken branches are recorded. The routinereads them out and accumulates them in memory. The value for ‘N’ is ahardware implementation parameter and it is normally quite small (e.g.,4). Moreover, with such kind of profiling schemes it is not possible toobtain the ratio between the number of occurrences (taken) and notoccurrences (not taken) for a given instruction/event pair (e.g., aconditional branch retired), as the hardware only records the last Noccurrences and does not record “not” occurrences. If it did, theroutine would need to be invoked very frequently (every N conditionalbranch instructions if possible), resulting in significant overhead.Furthermore, these schemes do not offer the option of specifying afiltering address range to identify certain portions of program code forprofiling. Hence, the obtained profile information may belong to anyinstruction, and potentially to instructions which do not requireoptimization.

Current processors also provide interfaces to monitor the behavior of anapplication. However, in these implementations, profiling information isobtained at a coarse grain and merely identifies whether a small orlarge amount of the desired events occurred. Once again, using thesetechniques, it is not possible to obtain the ratio between occurrencesand not occurrences of such events with individual instructions.

In summary, there is currently no simple, flexible and inexpensivemechanism to obtain accurate profiling information.

BRIEF DESCRIPTION OF THE DRAWINGS

A better understanding of the present invention can be obtained from thefollowing detailed description in conjunction with the followingdrawings, in which:

FIG. 1 illustrates one embodiment of an apparatus for performingprofiling operations.

FIG. 2 illustrates one embodiment of a method for performing profilingoperations.

FIG. 3 illustrates an exemplary computer system on which embodiments ofthe invention may be implemented.

FIG. 4 illustrates another exemplary computer system on whichembodiments of the invention may be implemented.

DETAILED DESCRIPTION

In the following description, for the purposes of explanation, numerousspecific details are set forth in order to provide a thoroughunderstanding of the embodiments of the invention described below. Itwill be apparent, however, to one skilled in the art that theembodiments of the invention may be practiced without some of thesespecific details. In other instances, well-known structures and devicesare shown in block diagram form to avoid obscuring the underlyingprinciples of the embodiments of the invention.

In one embodiment of the invention, hardware support is provided toperform accurate profiling in a more hardware/software collaborativemanner. In this embodiment, the intelligence to determine what and whento profile is performed in software and the collection of accurateprofile information (e.g., associating events and the ratios ofoccurrences/not occurrences to individual instructions) is performed byhardware, incurring no additional overhead.

As described in detail below, in one embodiment, the hardware componentis a relatively small and simple structure which associates theoccurrences and not occurrences of some programmed events withindividual instructions. This structure may be from 4 to 16 entrieslarge. It should be noted, however, that the underlying principles arenot limited to such a structure or to any specific number of entries.

In one embodiment, the software component is responsible for determiningwhat and how to profile. The software may apply heuristics to determineevents to profile and for which instructions. Furthermore, the softwareof this embodiment may extend the hardware structure by readinginformation from it regularly and updating a similar software structureheld in memory with the accumulated information. The hardware componentof one embodiment provides an interface to allow the interaction withthe software component, as described in greater detail below.

As illustrated in FIG. 1, one embodiment of the hardware componentincludes an event selection component 100, a filtering component 110,and a profiling component 120. The event selection component 100receives several 1-bit event signals (shown as “Events 1-4”), several1-bit Event Enable signals (shown as “Event 1-4 En”), and an instructionidentifier (ID) which identifies the retiring instruction associatedwith the aforementioned event signals. By way of example, and notlimitation, “Event 1” may be an L1 cache hit/miss indicator (e.g., wherea one indicates that an L1 cache miss occurred while a zero indicatesthat an L1 cache hit occurred) and the signal “Event 1 En” may indicatewhether an L1 hit/miss can occur for that particular instruction. Forexample, the enable signal may be set to one for loads and stores andset to zero for arithmetic operations, branch instructions, and otheroperations unrelated to an L1 cache hit/miss. By way of example, and notlimitation, FIG. 1 assumes a single retiring instruction at a time. Theextensions to accommodate more retiring instructions are straightforward to one skilled in the art that the invention may be practiced.

In one embodiment, the event selection component 100 includes a maskregister 101 in which software selects events to profile. The outputfrom the mask register 101 controls event derivation blocks 105 and 106which, in response, generate event signals for the profiling component120. In one embodiment, the event derivation blocks 105, 106 aremultiplexers; however, the underlying principles of the invention arenot limited to any particular logical structure. In the example shown inFIG. 1, for the purposes of illustration, it is assumed that only twoevents—Event A and Event B—are profiled together, where the signals andtheir corresponding enabling signals are derived from the incoming 1-bitEvent and Event Enable signals, respectively. The more events to profileat the same time, the more contention there will be in the hardwarestructure and the more write ports may be needed.

In one embodiment, the filtering component 110 is configured by acontrol register 102. Profiling may be enabled or disabled by properlysetting an Enable bit in this register (e.g., with software). Inaddition, an instruction ID range such as a program counter (PC) addressrange may be specified to profile within the control register,identified with a low instruction ID value (e.g., a low address value)and high instruction ID value (e.g., a high address value), as indicatedin FIG. 1. An instruction ID range filtering block 104 receives theinstruction ID (e.g., the current program counter address) and the lowand high instruction IDs from the control register 102 and responsivelygenerates a binary signal to indicate whether the current instruction IDfalls within the designated range. While one embodiment of the inventionuses the program counter address as the instruction ID and programcounter address ranges as instruction ID ranges, the underlyingprinciples of the invention are not limited to the use of programcounter addresses for instruction IDs. Other forms of instruction IDcodes may be used while still complying with the underlying principlesof the invention. In the specific implementation shown in FIG. 1, thebinary output from the address range filtering block 104 and the binaryenable signal from the control register are provided to an AND gate 103which responsively provides a binary enable/disable signal to theprofiling component 120. Of course, various logical structures may beused in lieu of an AND gate while still complying with the underlyingprinciples of the invention (e.g., a NAND gate). As a result of theinstruction ID range filtering, all instructions belonging to thespecified address range may be profiled by the profiling component 120.This scheme, in which only a subset of the instructions are profiled ata given point in time, is beneficial, as compilers and/or binarytranslators focus their optimizations to individual sections of code oneat a time. This provides for a relatively small hardware structure whichmay be extended by software if needed.

In one embodiment, the profiling component 120 includes a profileregister 121 with N entries used to retain profiling information. It hasbeen determined that a structure with a relatively small number ofentries (e.g., between 4 and 16) is sufficient to capture accurateprofiling information. The number of entries and the read/write portsrequired may dictate the associativity of the structure.

In one embodiment, each entry within the profile register 121 has thefollowing fields:

-   -   A Valid bit which indicates whether or not the entry is valid.    -   An Event ID field to distinguish the event being profiled by the        entry. In FIG. 1, where only two events are tracked at the same        time (Event A and Event B), this field would be 1 bit long. If        only one event is tracked at the same time, this field would not        be necessary.    -   Instruction ID field bits to uniquely identify the instruction.        In one embodiment, this takes the form of the program counter of        the instruction.    -   A Saturated bit to indicate whether any of the two next counters        is saturated.    -   A Number of Occurrences field which, in one embodiment, is a        counter that counts how many times the event being profiled by        the entry occurred.    -   A Number of “Not Occurrences” which, in one embodiment, is a        counter that counts how many times the event being profiled by        the entry did not occur.

It has been determined that 15-bit counters are sufficient to accuratelycapture the ratio between the amount of times that the event occurredand the amount of times it did not occur. However, the final particularapplicability of this invention requires an analysis to set up anappropriate counter size in order to find the better trade-off betweenhardware complexity and profiling accuracy.

One embodiment of the profiling component 120 operates according to themethod shown in FIG. 2. At 201, when an instruction/event pair (e.g., aninstruction ID and Event A pair in FIG. 1) is to be profiled (e.g., whenthe DO_PROFILE and the Event A En signals in FIG. 1 are set) oneembodiment of the profiling component 120 first checks whether any ofthe entries in the profile register 121 match. In one embodiment, a“match” means that the instruction ID and event ID are found in anexisting entry and that the entry is marked as valid. If so, then at205, the “saturated” bit is checked. A one indicates that one of thecounters already reached the maximum value and, in order not to overflowit and maintain the correct ratio of number of occurrences versus numberof “not occurrences” up to that point, that entry is frozen. In such acase, at 209 nothing is counted regardless of which counter saturated.

However, if the saturated bit is clear, in one embodiment, thecorresponding counter is increased. Specifically, if the correspondingevent signal is set (e.g. Event A signal in FIG. 1), determined at 208,then the number of occurrences is increased by one at 210; otherwise,the number of “not occurrences” is increased by one at 211. Thesaturated bit is then updated at 213. In one embodiment, this isaccomplished with the carry flag of the adder.

If there is no entry matching the current instruction/event pair,determined at 201, one embodiment of the invention attempts to allocateone only when an event occurred, determined at 202. Allocating only whenthe event occurs (which should be a relatively rare case) filters outmany instruction/event pairs where the event never happens. This leavesmore room for other instruction/event pairs to be profiled using limitedhardware resources. By way of example, and not limitation, the programcode may specify that profiling is to be performed on the hit/missbehavior of load instructions with respect to the L1 cache. In thisscenario, an entry may be allocated in the presence of an L1 cache missin order to filter out the many load instructions that never miss in theL1 cache (i.e., the “event” is defined as an L1 cache miss). At 206, ifno event is detected, the process terminates and no entries areallocated/updated.

It should be noted that the “event” in the “instruction/event pair” 200used to trigger the method in FIG. 2, refers to either an “eventoccurred” or an “event not occurred” condition. For example, the sameevent ID may identify a cache hit or miss while the “event occurred”decision block 208 may indicate only whether a cache miss occurred. Saidanother way, the “event” is defined as a cache miss, but either a cachemiss or a cache hit will trigger the illustrated method (e.g., using thesame event ID).

In order to allocate an entry at 207, one embodiment of the inventionfirst determines whether there is any free entry at 203 (e.g., an entryhaving a cleared “valid” bit). If not, this means that all entries arebeing used and nothing occurs at 204. In one embodiment, this means thatthere is no entry replacement policy built in to the apparatus shown inFIG. 1. In such a case, it is the program code that may clear thecontents of the profile register 121 (e.g., by setting some or all ofthe valid bits to zero through write operations). It may be the casethat regular replacement algorithms such as least-recently-used (LRU)and pseudo-LRU perform poorly for these kinds of profiling structures.As such, more complex replacement techniques may instead be used. Oneembodiment of the invention avoids complexity by not implementing ahardware replacement policy and by providing a rich software interface(as explained below).

If free entries exist, one is allocated at 207 (e.g., infirst-in-first-out (FIFO) order). When an entry is allocated, the eventID and instruction ID fields are initialized to the correspondingvalues, the “valid” bit field is set, the “saturated” bit field isclear, the number of “not occurrences” counter is set to zero, and thenumber of occurrences counter is set to one.

In one embodiment, software may read and write the entries in theprofiling component 120 as needed. Each entry is identified by a corespecial register (CSR) (Profile Registers 121 in FIG. 1), offering arich software interface. By way of example, and not limitation, thesoftware may read the whole structure at some point in time andaccumulate the profiled information in a corresponding softwarestructure held in memory. At that point, the software may clear theentries by setting all valid bits to zero. Alternatively, or inaddition, it may reset the counters, but leave the rest of the fields asthey are. In such a case, the same instruction/event pairs would beprofiled for some additional time but with fewer chances to saturate thecounters. Another option would be to initialize some of the entries (thevalid bit and the instruction/event pair fields) and leave other entriesfree. This may have the effect of pre-booking some entries to specificinstruction/event pairs that the software believes may be problematic,while the free entries would be allocated dynamically based on theexecution of the application as explained before. A variety of differentprogramming choices may be employed while still complying with theunderlying principles of the invention. Moreover, it should be notedthat the underlying principles of the invention are not limited to thespecific interface options discussed above.

Some experiments were conducted to confirm the design of the apparatusand method described herein. A brief summary of the results follows.

The experiments were conducted using the Code Morphing Software. Inparticular, the CMS performs sampling in order to decide whether a pieceof code (a translation) is utilized enough to optimize it aggressively.When the same translation has been sampled a specific number of times,it promotes it to a more aggressive optimization stage. At this point,when the translation reaches this threshold, it is profiled for 400,000core cycles (a parameter in the simulations) and the optimizer ispostponed until then.

A first experiment consisted of identifying delinquent loads (loads thatmiss more than 10% in the L1 cache) for the hot translations in order toapply aggressive code reordering techniques and prefetching. In thiscase, the selected event was an L1 cache miss, i.e., allocation onlyhappened when an instruction missed in the L1 cache, thereby filteringout the many instructions that never miss the L1 cache. Using more than500 simulation points belonging to SPEC 2000 benchmarks, Dacapobenchmarks (Java programs), High Definition Video benchmarks, andPhysicbench (physics benchmarks), it was observed that the error fordetecting delinquent loads was only 0.4% with an 8 entry 4-way setassociative hardware structure with 15-bit counters.

Another experiment consisted on capturing the precise taken/fallthruratio of conditional branches in order to apply aggressive codereordering techniques and converting biased branches into assertoperations. In this case, the selected event was a taken conditionalbranch. Hence, allocation only occurred when a conditional branch wastaken, thereby filtering out many conditional branches that neverbranch. Using more than 500 simulation points belonging to SPEC 2000benchmarks, Dacapo benchmarks (Java programs), High Definition Videobenchmarks, and Physicbench (physics benchmarks), it was observed thatthe error for computing the taken ratio for conditional branches wasonly 3% with an 8 entry 4-way set associative hardware structure with15-bit counters.

The techniques described above exploit hardware support to performflexible, accurate, and/or efficient code profiling in ahardware/software collaborative manner. These techniques can be usefulfor various different applications including, but not limited toCo-designed Virtual Machines, such as Transmeta Efficeon machines orIBM's BOA project designs. With these implementations, a software layer(Code Morphing Software) emulates, translates and optimizes guestinstructions (x86 or PowerPC) on top of a simple very-long instructionword (VLIW) hardware design.

These techniques may also be used with just-in-time (JIT) compilers suchas Java Virtual machines or the Microsoft Common Language Runtime (CLR)virtual machine. In such systems, a software layer emulates andoptimizes instructions from a standard instruction set architecture(ISA) (e.g., bytecode) to the native ISA that the virtual machine isrunning on. The same reasoning applies to other kinds of JIT compilerssuch as IA-32 EL, an Intel product designed to execute IA-32 binaries ontop of an Itanium Processor Family (IPF) machine.

In addition, the techniques described above may be implemented withstandard compilers such as the GNU Compiler Collection (“gcc”). In thesecases, profile-guided optimizations may be used to generate more compactand efficient binaries.

FIG. 3 illustrates an exemplary computer system 300 upon whichembodiments of the invention may be implemented. The computer system 300comprises a system bus 320 for communicating information, and aprocessor 310 coupled to bus 320 for processing information. Computersystem 300 further comprises a random access memory (RAM) or otherdynamic storage device 325 (referred to herein as main memory), coupledto bus 320 for storing information and instructions to be executed byprocessor 310. Main memory 325 also may be used for storing temporaryvariables or other intermediate information during execution ofinstructions by processor 310. Computer system 300 also may include aread only memory (ROM) and/or other static storage device 326 coupled tobus 320 for storing static information and instructions used byprocessor 310.

A data storage device 327 such as a magnetic disk or optical disc andits corresponding drive may also be coupled to computer system 300 forstoring information and instructions. The computer system 300 can alsobe coupled to a second I/O bus 350 via an I/O interface 330. A pluralityof I/O devices may be coupled to I/O bus 350, including a display device343, an input device (e.g., an alphanumeric input device 342 and/or acursor control device 841).

The communication device 340 is used for accessing other computers(servers or clients) via a network, and uploading/downloading varioustypes of data. The communication device 340 may comprise a modem, anetwork interface card, or other well known interface device, such asthose used for coupling to Ethernet, token ring, or other types ofnetworks.

FIG. 4 is a block diagram illustrating another exemplary data processingsystem which may be used in some embodiments of the invention. The dataprocessing system 400 may be, for example, a handheld or laptopcomputer, a personal digital assistant (PDA), a mobile telephone, aportable gaming system, a portable media player, a tablet or a handheldcomputing device which may include a mobile telephone, a media player,and/or a gaming system. As another example, the data processing system400 may be a network computer or an embedded processing device withinanother device.

According to one embodiment of the invention, the exemplary architectureof the data processing system 400 may used for the mobile devicesdescribed above. The data processing system 400 includes the processingsystem 420, which may include one or more microprocessors and/or asystem on an integrated circuit. The processing system 420 is coupledwith a memory 410, a power supply 425 (which includes one or morebatteries) an audio input/output 440, a display controller and displaydevice 460, optional input/output 450, input device(s) 470, and wirelesstransceiver(s) 430. It will be appreciated that additional components,not shown in FIG. 4, may also be a part of the data processing system400 in certain embodiments of the invention, and in certain embodimentsof the invention fewer components than shown in FIG. 4 may be used. Inaddition, it will be appreciated that one or more buses, not shown inFIG. 4, may be used to interconnect the various components as is wellknown in the art.

The memory 410 may store data and/or programs for execution by the dataprocessing system 400. The audio input/output 940 may include amicrophone and/or a speaker to, for example, play music and/or providetelephony functionality through the speaker and microphone. The displaycontroller and display device 460 may include a graphical user interface(GUI). The wireless (e.g., RF) transceivers 430 (e.g., a WiFitransceiver, an infrared transceiver, a Bluetooth transceiver, awireless cellular telephony transceiver, etc.) may be used tocommunicate with other data processing systems. The one or more inputdevices 470 allow a user to provide input to the system. These inputdevices may be a keypad, keyboard, touch panel, multi touch panel, etc.The optional other input/output 450 may be a connector for a dock.

Other embodiments of the invention may be implemented on cellular phonesand pagers (e.g., in which the software is embedded in a microchip),handheld computing devices (e.g., personal digital assistants,smartphones), and/or touch-tone telephones. It should be noted, however,that the underlying principles of the invention are not limited to anyparticular type of communication device or communication medium.

Embodiments of the invention may include various steps, which have beendescribed above. The steps may be embodied in machine-executableinstructions which may be used to cause a general-purpose orspecial-purpose processor to perform the steps. Alternatively, thesesteps may be performed by specific hardware components that containhardwired logic for performing the steps, or by any combination ofprogrammed computer components and custom hardware components.

Elements of the present invention may also be provided as a computerprogram product which may include a machine-readable medium havingstored thereon instructions which may be used to program a computer (orother electronic device) to perform a process. The machine-readablemedium may include, but is not limited to, floppy diskettes, opticaldisks, CD-ROMs, and magneto-optical disks, ROMs, RAMs, EPROMs, EEPROMs,magnet or optical cards, propagation media or other type ofmedia/machine-readable medium suitable for storing electronicinstructions. For example, the present invention may be downloaded as acomputer program product, wherein the program may be transferred from aremote computer (e.g., a server) to a requesting computer (e.g., aclient) by way of data signals embodied in a carrier wave or otherpropagation medium via a communication link (e.g., a modem or networkconnection).

Throughout this detailed description, for the purposes of explanation,numerous specific details were set forth in order to provide a thoroughunderstanding of the present invention. It will be apparent, however, toone skilled in the art that the invention may be practiced without someof these specific details. In certain instances, well known structuresand functions were not described in elaborate detail in order to avoidobscuring the subject matter of the present invention. Accordingly, thescope and spirit of the invention should be judged in terms of theclaims which follow.

1. A machine-implemented method for profiling program code comprising:identifying a first set of the instructions for which profiling isdesired; associating profiling events with each of the first set ofinstructions; receiving an indication that an instruction has beenretired; determining whether the instruction is within the first set ofinstructions for which profiling is desired; and if the instruction iswithin the first set, then determining whether a designated eventassociated with the instruction has occurred or not occurred; andrecording the occurrence or not occurrence of the event within a firststorage device.
 2. The method as in claim 1 wherein identifyingcomprises specifying a particular address range and identifyinginstructions within the address range as being instructions for whichprofiling is desired.
 3. The method as in claim 2 wherein the range isspecified using a low address value and a high address value.
 4. Themethod as in claim 3 wherein the instruction is identified as fallingwithin the range based on a program counter value associated with theinstruction.
 5. The method as in claim 1 wherein the occurrence/notoccurrence of the event is identified using a particular eventidentifier (ID) code.
 6. The method as in claim 1 wherein the storagedevice comprises a profile register having N entries, each of theentries identifying an instruction/event pair using an instruction IDand an event ID.
 7. The method as in claim 2 wherein specifying theaddress range comprises programming a control register with a lowaddress value and a high address value, the control register being usedto filter out instructions falling outside of the range defined by thelow address value and the high address value.
 8. The method as in claim1 wherein the first storage device is a register having an entry foreach of a plurality of instruction/event pairs, each entry recording anumber of occurrences and a number of not occurrence of a particularevent for a particular instruction.
 9. The method as in claim 8 furthercomprising: reading one or more entries from the register into a mainmemory or another storage device; and invalidating the one or moreentries in the register following the reading of the entries into mainmemory or another storage device; and reading/writing any individualfield/entry from the register to provide flexibility andconfigurability.
 10. An apparatus for profiling program code comprising:a filtering component identifying a first set of instructions for whichprofiling is desired wherein, in response to detecting that aninstruction has been retired, the filtering component determines whetherthe instruction is within the first set of instructions for whichprofiling is desired; an event selection component detecting an event inresponse to the instruction retiring, the event selection componentgenerating event signals in response to a designated event; and aprofiling component recording the occurrence or not occurrence of theevent within a first storage device responsive to signals from thefiltering component and/or the event selection component.
 11. Theapparatus as in claim 10 wherein identifying comprises specifying aparticular address range and identifying instructions within the addressrange as being instructions for which profiling is desired.
 12. Theapparatus as in claim 11 wherein the range is specified using a lowaddress value and a high address value.
 13. The apparatus as in claim 12wherein the instruction is identified as falling within the range basedon a program counter value associated with the instruction.
 14. Theapparatus as in claim 10 wherein the occurrence/not occurrence of theevent is identified using a particular event identifier (ID) code. 15.The apparatus as in claim 10 wherein the storage device comprises aprofile register having N entries, each of the entries identifying aninstruction/event pair using an instruction ID and an event ID.
 16. Theapparatus as in claim 11 wherein specifying the address range comprisesprogramming a control register with a low address value and a highaddress value, the control register being used to filter outinstructions falling outside of the range defined by the low addressvalue and the high address value.
 17. The apparatus as in claim 10wherein the first storage device is a register having an entry for eachof a plurality of instruction/event pairs, each entry recording a numberof occurrences and a number of not occurrence of a particular event fora particular instruction.
 18. The apparatus as in claim 17 furthercomprising: an interface to read one or more entries from the registerinto a main memory or another storage device; and invalidate the one ormore entries in the register following the reading of the entries intomain memory or another storage device; and reading/writing anyindividual field/entry from the register to provide flexibility andconfigurability.
 19. The apparatus as in claim 10 wherein the filteringcomponent, event selection component and profiling component are allimplemented as logic within a single semiconductor chip.
 20. A computersystem comprising: a display device; a memory for storing instructions;a processor for processing the instructions; and an apparatus forprofiling program code comprising: a filtering component identifying afirst set of instructions for which profiling is desired wherein, inresponse to detecting that an instruction has been retired, thefiltering component determines whether the instruction is within thefirst set of instructions for which profiling is desired; an eventselection component detecting an event in response to the instructionretiring, the event selection component generating event signals inresponse to a designated event; and a profiling component recording theoccurrence or not occurrence of the event within a first storage deviceresponsive to signals from the filtering component and/or the eventselection component.